Securely min and k-th min computations with fully homomorphic encryption
نویسندگان
چکیده
منابع مشابه
Fully Homomorphic Encryption for Secure Computations in Protected Database
Outsourced computations and, more particularly, cloud computations, are widespread nowadays. That is why the problem of keeping the data security arises. Multiple fully homomorphic cryptosystems were proposed in order to perform secret computations in untrusted environments. But most of the existent solutions are practically inapplicable as they require huge computation resources and produce bi...
متن کاملFaster Fully Homomorphic Encryption
We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improv...
متن کاملFully Homomorphic Encryption
Achieving fully homomorphic encryption, under any kind of reasonable computational assumptions (and under any reasonable definition of ”reasonable”..), was a holy grail of cryptography for many years until finally achieved by Craig Gentry in 2009. In these lectures we’ll describe a somewhat simplified variant of Gentry’s construction obtained by van Dijk, Gentry, Halevi and Vaikuntanathan (with...
متن کاملFully Homomorphic Encryption
In these notes we describe how to use our family of random lattices Λq(A) to build a fully homomorphic encryption scheme, i.e., an encryption scheme that allows to perform arbitrary computations on encrypted messages, without knowing the secret decryption key. For simplicity, we consider private encryption schemes, where the encryption and decryption algorithms use the same secret key. This is ...
متن کاملThreshold Fully Homomorphic Encryption
We formally define and give the first construction of (leveled) threshold fully homomorphic encryption for any access structure induced by a monotone boolean formula and in particular for the threshold access structure. Our construction is based on the learning with errors assumption and can be instantiated with any existing homomorphic encryption scheme that satisfies fairly general conditions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2017
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-017-9205-0